Direct Sparse Mapping

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Randomized Sparse Direct Solvers

We propose randomized direct solvers for large sparse linear systems, which integrate randomization into rank structured multifrontal methods. The use of randomization highly simplifies various essential steps in structured solutions, where fast operations on skinny matrix-vector products replace traditional complex ones on dense or structured matrices. The new methods thus significantly enhanc...

متن کامل

Direct Solvers for Sparse Matrices

There is a vast variety of algorithms associated with each step. The review papers by Duff [16] (see also [15, Chapter 6]) and Heath et al. [27] can serve as excellent reference of various algorithms. Usually steps 1 and 2 involve only the graphs of the matrices, and hence only integer operations. Steps 3 and 4 involve floating-point operations. Step 3 is usually the most time-consuming part, w...

متن کامل

Parallel Direct Methodsfor Sparse Linear

We present an overview of parallel direct methods for solving sparse systems of linear equations, focusing on symmetric positive deenite systems. We examine the performance implications of the important diierences between dense and sparse systems. Our main emphasis is on parallel implementation of the numerically intensive factorization process, but we also brieey consider the other major compo...

متن کامل

Matrix-free Sparse Direct Solvers

Existing direct solvers for large linear systems, especially sparse ones, require the matrices to be explicitly available. In practical computations, often only matrix-vector products instead of the matrix are available, which makes iterative methods the only choice. Here, we derive matrix-free sparse direct solvers based on matrixvector products. Two stages are involved. The first stage is to ...

متن کامل

Sparse Polynomial Mapping for Manifold Learning

Manifold learning is an approach for nonlinear dimensionality reduction and has been a hot research topic in the field of computer science. A disadvantage of manifold learning methods is, however, that there are no explicit mappings from the high-dimensional feature space to the low-dimensional representation space. It restricts the application of manifold learning methods in many practical pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Robotics

سال: 2020

ISSN: 1552-3098,1941-0468

DOI: 10.1109/tro.2020.2991614